Hyperbolic node embedding for signed networks
نویسندگان
چکیده
Signed network embedding methods aim to learn vector representations of nodes in signed networks. However, existing algorithms only managed embed networks into low-dimensional Euclidean spaces whereas many intrinsic features are reported more suitable for non-Euclidean spaces. For instance, previous works did not consider the hierarchical structures networks, which is widely witnessed real-world In this work, we answer an open question that whether hyperbolic space a better choice accommodate and embeddings can preserve corresponding special characteristics. We also propose method based on structural balance theory Riemannian optimization, embeds Poincar\'e ball space. This enables our approach capture underlying hierarchy because it be seen as continuous tree. empirically compare against six Euclidean-based baselines three tasks seven datasets, results show effectiveness method.
منابع مشابه
Node Classification in Signed Social Networks
Node classification in social networks has been proven to be useful in many real-world applications. The vast majority of existing algorithms focus on unsigned social networks (or social networks with only positive links), while little work exists for signed social networks. It is evident from recent developments in signed social network analysis that negative links have added value over positi...
متن کاملSNE: Signed Network Embedding
Several network embedding models have been developed for unsigned networks. However, these models based on skip-gram cannot be applied to signed networks because they can only deal with one type of link. In this paper, we present our signed network embedding model called SNE. Our SNE adopts the log-bilinear model, uses node representations of all nodes along a given path, and further incorporat...
متن کاملSigned Laplacian Embedding for Supervised Dimension Reduction
Manifold learning is a powerful tool for solving nonlinear dimension reduction problems. By assuming that the high-dimensional data usually lie on a low-dimensional manifold, many algorithms have been proposed. However, most algorithms simply adopt the traditional graph Laplacian to encode the data locality, so the discriminative ability is limited and the embedding results are not always suita...
متن کاملSigned Node Relevance Measurements
In this paper, we perform the initial and comprehensive study on the problem of measuring node relevance on signed social networks. We design numerous relevance measurements for signed social networks from both local and global perspectives and investigate the connection between signed relevance measurements, balance theory and signed network properties. Experimental results are conducted to st...
متن کاملBounded Stretch Homotopic Routing Using Hyperbolic Embedding of Sensor Networks
In this paper we consider lightweight routing in a wireless sensor network deployed in a complex geometric domain Σ with holes. Our goal is to find short paths of different homotopy types, i.e., paths that go around holes in different ways. In the example of Figure 1, there are three holes in the network and there are many different ways to “thread” a route from s to t. Observe that paths α, β,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neurocomputing
سال: 2021
ISSN: ['0925-2312', '1872-8286']
DOI: https://doi.org/10.1016/j.neucom.2020.10.008